On Coordinate-Wise Minimization Applied to General Convex Optimization Problems
نویسندگان
چکیده
منابع مشابه
On Coordinate Minimization of Convex Piecewise-Affine Functions
A popular class of algorithms to optimize the dual LP relaxation of the discrete energy minimization problem (a.k.a. MAP inference in graphical models or valued constraint satisfaction) are convergent message-passing algorithms, such as max-sum diffusion, TRW-S, MPLP and SRMP. These algorithms are successful in practice, despite the fact that they are a version of coordinate minimization applie...
متن کاملThe convex optimization approach to regret minimization
A well studied and general setting for prediction and decision making is regret minimization in games. Recently the design of algorithms in this setting has been influenced by tools from convex optimization. In this chapter we describe the recent framework of online convex optimization which naturally merges optimization and regret minimization. We describe the basic algorithms and tools at the...
متن کاملEfficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: application to distributed MPC
In this paper we propose a parallel coordinate descent algorithm for solving smooth convex optimization problems with separable constraints that may arise e.g. in distributed model predictive control (MPC) for linear network systems. Our algorithm is based on block coordinate descent updates in parallel and has a very simple iteration. We prove (sub)linear rate of convergence for the new algori...
متن کاملStochastic Coordinate Descent for Nonsmooth Convex Optimization
Stochastic coordinate descent, due to its practicality and efficiency, is increasingly popular in machine learning and signal processing communities as it has proven successful in several large-scale optimization problems , such as l1 regularized regression, Support Vector Machine, to name a few. In this paper, we consider a composite problem where the nonsmoothness has a general structure that...
متن کاملApplying Convex Optimization Techniques to Energy Minimization Problems in Computer Vision
APPLYING CONVEX OPTIMIZATION TECHNIQUES TO ENERGY MINIMIZATION PROBLEMS IN COMPUTER VISION Arvind Bhusnurmath C.J.Taylor Energy minimization is an important technique in computer vision that has been applied to practically all early vision problems. Several methods have been proposed to solve the problem and to date, the most popular ones have been discrete optimization approaches such as graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2020
ISSN: 1877-0509
DOI: 10.1016/j.procs.2020.09.142